Divide-and-conquer Generating Functions Elementary Sequences
نویسنده
چکیده
Divide-and-conquer functions satisfy equations in F(z), F(z2), F(z4) . . .. Their generated sequences are mainly used in computer science, and they were analyzed pragmatically, that is, now and then a sequence was picked out for scrutiny. By giving several classes of ordinary generating functions togetherwith recurrences, we hope to helpwith the analysis of many such sequences, and try to classify a part of the divide-and-conquer sequence zoo.
منابع مشابه
On Parity based Divide and Conquer Recursive Functions
The parity based divide and conquer recursion trees are introduced where the sizes of the tree do not grow monotonically as n grows. These non-monotonic recursive functions called fogk(n) and f̃ogk(n) are strictly less than linear, o(n) but greater than logarithm, Ω(logn). Properties of fogk(n) such as non-monotonicity, upper and lower bounds, etc. are examined and proven. These functions are us...
متن کاملFree Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کاملImproving the Divide-and-Conquer Approach to Sum-of-Pairs Multiple Sequence Alignment
We consider the problem of multiple sequence alignment: given k sequences of length at most n and a certain scoring function, find an alignment that minimizes the corresponding “sum of pairs” distance score. We generalize the divide-and-conquer technique described in [1,2], and present new ideas on how to use efficient search strategies for saving computer memory and accelerating the procedure ...
متن کاملAlgebraic Aspects of B-regular Series
This paper concerns power series of an arithmetic nature that arise in the analysis of divide-and-conquer algorithms. Two key notions are studied: that of B-regular sequence and that of Mahlerian sequence with their associated power series. Firstly we emphasize the link between rational series over the alphabet fx0;x1;:::;xB?1g and B-regular series. Secondly we extend the theorem of Christol, K...
متن کاملRational series and asymptotic expansion for linear homogeneous divide-and-conquer recurrences
Among all sequences that satisfy a divide-and-conquer recurrence, the sequences that are rational with respect to a numeration system are certainly the most immediate and most essential. Nevertheless, until recently they have not been studied from the asymptotic standpoint. We show how a mechanical process permits to compute their asymptotic expansion. It is based on linear algebra, with Jordan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008